package com.hardy.job;

/**
 * @author fuxiaohui3@nuoyuan.com.cn
 * @date 2018/11/9 9:31
 */
public class QuickSortCountTopk {
    public static void main(String[] args) {

    }
    public int partition(int[] a,int low,int high){
        int temp = a[low];
        while (low<high){
            while (low<high&&a[high]>=temp){
                high--;
            }
            a[low]=a[high];
            while (low<high&&a[low]<=temp){
                low++;
            }
            a[high]=a[low];
        }
        a[low]=temp;
        return low;
    }
}
